The stable regularity lemma revisited
نویسندگان
چکیده
منابع مشابه
The stable regularity lemma revisited
We prove a regularity lemma with respect to arbitrary Keisler measures μ on V , ν on W where the bipartite graph (V,W,R) is definable in a saturated structure M̄ and the formula R(x, y) is stable. The proof is rather quick, making use of local stability theory. The special case where (V,W,R) is pseudofinite, μ, ν are the counting measures, and M̄ is suitably chosen (for example a nonstandard mode...
متن کاملSzemerédi's regularity lemma revisited
Szemerédi’s regularity lemma is a basic tool in graph theory, and also plays an important role in additive combinatorics, most notably in proving Szemerédi’s theorem on arithmetic progressions [19], [18]. In this note we revisit this lemma from the perspective of probability theory and information theory instead of graph theory, and observe a slightly stronger variant of this lemma, related to ...
متن کاملHow to avoid using the Regularity Lemma: Pósa's conjecture revisited
In this paper we investigate how the use of the Regularity Lemma and the Blow-up Lemma can be avoided in certain extremal problems of dense graphs. We present the ideas for the following well-known Pósa conjecture on the square of a Hamiltonian cycle. In 1962 Pósa conjectured that any graph G of order n and minimum degree at least 3n contains the square of a Hamiltonian cycle. In an earlier pap...
متن کاملSzemerédi’s Regularity Lemma
Szemerédi’s Regularity Lemma is an important result in extremal graph theory. Roughly speaking, the lemma states that every graph can be approximated by random graphs; that is, the vertex set of every graph can be split into equal size subsets such that the distribution of the edges between almost any two of these subsets is pseudorandom. The Regularity Lemma has already proved to be a powerful...
متن کاملThe Farkas Lemma Revisited
The Farkas Lemma is extended to simultaneous linear operator and polyhedral sublinear operator inequalities by Boolean valued analysis. Introduction The Farkas Lemma, also known as the Farkas–Minkowski Lemma, plays a key role in linear programming and the relevant areas of optimization (cp. [1]). Some rather simple proof of the lemma is given in [2]. Using the technique of Boolean valued analys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2015
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/12870